#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;

class Solution {
public:
    vector<vector<int>> findContinuousSequence(int target) {
        //注意本题中的为连续正整数序列
        vector<vector<int>> result;
        for(int i  = 1;i<=(target/2+1);++i){
            int sum = 0;
            vector<int> sonResult;
            for(int j = i;j<=(target/2+1);++j){
                sum += j;
                sonResult.push_back(j);
                if(sum==target){
                    result.push_back(sonResult);
                }
                if(sum>target){
                    break;
                }
            }
        }
        return result;
    }
};

int main(){
    Solution S;
    vector<vector<int>> result = S.findContinuousSequence(15);
    return 0;
}